Stochastic Coalitional Better-response Dynamics and Strong Nash Equilibrium

نویسندگان

  • Konstantin Avrachenkov
  • Vikas Vikram Singh
چکیده

We consider coalition formation among players in an n-player finite strategic game over infinite horizon. At each time a randomly formed coalition makes a joint deviation from a current action profile such that at new action profile all players from the coalition are strictly benefited. Such deviations define a coalitional better-response (CBR) dynamics that is in general stochastic. The CBR dynamics either converges to a strong Nash equilibrium or stucks in a closed cycle. We also assume that at each time a selected coalition makes mistake in deviation with small probability that add mutations (perturbations) into CBR dynamics. We prove that all strong Nash equilibria and closed cycles are stochastically stable, i.e., they are selected by perturbed CBR dynamics as mutations vanish. Similar statement holds for strict strong Nash equilibrium. We apply CBR dynamics to the network formation games and we prove that all strongly stable networks and closed cycles are stochastically stable. Key-words: Strong Nash equilibrium, Coalitional better-response, Stochastic stability, Network formation games, Strongly stable networks. ∗ Inria Sophia Antipolis, France, [email protected] † Inria Sophia Antipolis, France, [email protected] ‡ The authors’ names are given in alphabetical order. La dynamique de meilleure réponse de coalitions et l’équilibre de Nash fort Résumé : Nous considérons un processus de formation de coalitions entre les joueurs d’un jeu fini stratégique sur l’horizon de temps infini. Á chaque étape, une coalition formée au hasard fait une déviation conjointe de l’ensemble actuel des actions de telle sorte qu’au nouveau ensemble des actions, tous les joueurs de la coalition sont strictement bénéficié. Telles déviations définissent une dynamique de meilleure réponse de coalitions, Coalitional Better-Response dynamics en anglais (CBR), qui est en général stochastique. La dynamique CBR soit converge vers un équilibre de Nash fort ou á un cycle fermé. En outre, nous supposons que á chaque étape une coalition sélectionnée fait une faute avec faible probabilité qui ajoutent des mutations (perturbations) dans la dynamique CBR. Nous prouvons que tous les équilibres de Nash forts et les cycles fermés sont stochastiquement stable, ce est á dire, ils sont choisis par CBR perturbée quand les mutations disparaissent. Une affirmation similaire a lieu pour l’équilibre de Nash fort et stricte. Nous appliquons la dynamique CBR aux jeux de formation de réseau et nous prouvons que tous les réseaux fortement stables et des cycles fermés sont stochastiquement stable. Mots-clés : Forte équilibre de Nash, Coalitionnelle meilleure réponse, Stabilité stochastique, Jeux de formation de réseau, Réseaux fortement stable. Stochastic Coalitional Better-response Dynamics and Strong Nash Equilibrium 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong Price of Anarchy and Coalitional Dynamics

We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of noncooperative games. Coalitional smoothness implies bounds on the strong price of anarchy, the loss of quality of coalitionally stable outcomes, as well as bounds on coalitional versions of coarse correlated equilibria...

متن کامل

Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games

Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...

متن کامل

Coalitional Nash Equilibria

Let G be an N -player game in strategic form and C be a set of permissible coalition of players (exogenously given). A strategy profile σ is a coalitional-equilibrium if no permissible coalition in C has a unilateral deviation that profits to all its members. At the two extremes: when C contains only singleton players, σ reduces to a Nash equilibrium and when C consists on all coalitions of pla...

متن کامل

On Strong Equilibria and Improvement Dynamics in Network Creation Games

We study strong equilibria in network creation games. These form a classical and well-studied class of games where a set of players form a network by buying edges to their neighbors at a cost of a fixed parameter α. The cost of a player is defined to be the cost of the bought edges plus the sum of distances to all the players in the resulting graph. We identify and characterize various structur...

متن کامل

Better-reply dynamics and global convergence to Nash equilibrium in aggregative games

We consider n-person games with quasi-concave payoffs that depend on a player’s own action and the sum of all players’ actions. We show that a discrete-time, stochastic process in which players move towards better replies—the better-reply dynamics—converges globally to a Nash equilibrium if actions are either strategic substitutes or strategic complements for all players around each Nash equili...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1506.03311  شماره 

صفحات  -

تاریخ انتشار 2015